About Testing the Speed of Calculating the Shortest Route

نویسندگان

  • Tiberiu Marius Karnyanszky
  • Bogdan Ion Selariu
چکیده

Applied into a various area of domains, the graph theory and its applications allow the determination of the shortest route. The common algorithm to solve this problem is Bellman-Kalaba, based on the matrix multiplying operation. If the graph is very large (e.g., the dimension of the associated incidence matrix is big) one of the main problems is to reduce the calculus time. This paper presents a testing method able to analyze if an acceleration of the Bellman-Kalaba is possible and able to determine the time efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Route Planning in Vanet By Comparitive Study of Algoriths

Route planning techniques is one of the main tasks of VRP (Vehicles route planning) which aims to find an optimal route from a starting point to a destination. Various techniques have been proposed so far to calculate shortest path in VANET by different researchers. This paper presents a study about the two well-known shortest path searching algorithms, which are used in routing. They are Bellm...

متن کامل

Modeling different decision strategies in a time tabled multimodal route planning by integrating the quantifier-guided OWA operators, fuzzy AHP weighting method and TOPSIS

The purpose of Multi-modal Multi-criteria Personalized Route Planning (MMPRP) is to provide an optimal route between an origin-destination pair by considering weights of effective criteria in a way this route can be a combination of public and private modes of transportation. In this paper, the fuzzy analytical hierarchy process (fuzzy AHP) and the quantifier-guided ordered weighted averaging (...

متن کامل

Confidence Intervals for the Power of Two-Sided Student’s t-test

For the power of two-sided hypothesis testing about the mean of a normal population, we derive a 100(1 − alpha)% confidence interval. Then by using a numerical method we will find a shortest confidence interval and consider some special cases.

متن کامل

QoS- unbroken traffic lane streaming in Road network

At present situation travel becomes the biggest hassle for everyone. In this proposed research paper I have used GPS system to find out the shortest path to make your travel at ease. Through this navigation process it is clear-cut for us to find out right path. In this process, it is possible for an individual to analyse the exact shortest route from multiple paths. With the information from th...

متن کامل

Average Speed Estimation for Road Networks based on GPS Raw Trajectories

For applications involving displacements around cities, planners cannot count on moving at the legal speed limits. Indeed, the amount of circulating vehicles decreases the average speed and consequently increases the estimated time for daily trips. On the other hand, the number of available trajectories generated by GPS devices is growing. This paper presents a methodology to compute statistics...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0903.0578  شماره 

صفحات  -

تاریخ انتشار 2009